Decomposing graphs into forests of paths with size less than three
نویسندگان
چکیده
A forest in which every component is path is caned a path forest. A family of path forests whose edge sets form a partition of the set of a graph G is called a path of G. The minimum number of forests in a path decomposition of a graph G is the path number of G and denoted by p( G). If we restrict the number of edges in each path to be at most x then we obtain a special decomposition. The minimum number of path forests in this of decomposition is denoted In this paper we study We note here that if we restrict the size to be one, the number the chromatic index of G. In this paper, we study the special type of path and we obtain the answers for P2( G) when G is a complete graph, a tree and some other graphs.
منابع مشابه
Decomposing series-parallel graphs into paths of length 3 and triangles
An old conjecture by Jünger, Reinelt and Pulleyblank states that every 2-edgeconnected planar graph can be decomposed into paths of length 3 and triangles, provided its size is divisible by 3. We prove the conjecture for a class of planar graphs including all 2-edge-connected series-parallel graphs. We also present a 2edge-connected non-planar graph that can be embedded on the torus and admits ...
متن کاملDecomposing 4-connected planar triangulations into two trees and one path
Refining a classical proof of Whitney, we show that any 4-connected planar triangulation can be decomposed into a Hamiltonian path and two trees. Therefore, every 4-connected planar graph decomposes into three forests, one having maximum degree at most 2. We use this result to show that any Hamiltonian planar triangulation can be decomposed into two trees and one spanning tree of maximum degree...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملEdge-decomposing graphs into coprime forests
The Barát-Thomassen conjecture, recently proved in [3], asserts that for every tree T , there is a constant cT such that every cT -edge connected graph G with number of edges (size) divisible by the size of T admits an edge partition into copies of T (a T -decomposition). In this paper, we investigate in which case the connectivity requirement can be dropped to a minimum degree condition. For i...
متن کاملDecomposing highly edge-connected graphs into trees of small diameter
The Tree Decomposition Conjecture by Bárat and Thomassen states that for every tree T there exists a natural number k(T ) such that the following holds: If G is a k(T )-edge-connected simple graph with size divisible by the size of T , then G can be edge-decomposed into subgraphs isomorphic to T . The results on modulo k-orientations by Thomassen show that the Tree Decomposition Conjecture hold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 3 شماره
صفحات -
تاریخ انتشار 1991